The Evolution of Gennetic Algorithms: Towards Massive Parallelism
نویسنده
چکیده
One of the issues in creating any search technique is balancing the need for diverse exploration with the desire for efficient focusing. This paper explores a genetic algorithm (GA) architecture which is more resilient to local optima than other recently introduced GA models. and which provides the ability to focus search quickly. The GA uses a fine-grain parallel architecture to simulate evolution more closely than previous models. In order to motivate the need for fine-grain parallelism, this paper will provide an overview of the two preceding phases of development: the traditional genetic algorithm, and the coarse-grain parallel GA. A test set of 15 problems is used to compare the effectiveness of a fine-grain parallel GA with that of a coarse-grain parallel GA.
منابع مشابه
Efficient Data Mining with Evolutionary Algorithms for Cloud Computing Application
With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...
متن کاملMaslsively Parallel Computers: Why Not Prwallel Computers for the Masses?
During the 1980s the computers engineering and science research community generally ignored parallel processing. With a focus on high performance computing embodied in the massive 1990s High Performance Computing and Communications (HPCC) program that has the short-term, teraflop peak performanc~: goal using a network of thousands of computers, everyone with even passing interest in parallelism...
متن کاملIncreasing the Accuracy of Recommender Systems Using the Combination of K-Means and Differential Evolution Algorithms
Recommender systems are the systems that try to make recommendations to each user based on performance, personal tastes, user behaviors, and the context that match their personal preferences and help them in the decision-making process. One of the most important subjects regarding these systems is to increase the system accuracy which means how much the recommendations are close to the user int...
متن کاملMassive Parallelization of Divide-and-Conquer Algorithms over Powerlists
problem adequate structure powerlists We present transformation rules to parallelize Divide-and-Conquer (DC) algorithms over powerlists. These rules convert the parallel control structure of DC into a sequential control flow, thereby making the implicit massive data parallelism in a DC scheme explicit. The results given here are illustrated by many examples including Fast Fourier Transform and ...
متن کاملA Study of the Role of Repetition of Music in the Nimayee Poems of Akhavan Sales
In this article, the aim of the authors is to study the role of repetition in creating music and parallelism in Nimayee poems in the three collections of poems by Mehdi Akhavan Sales: Zamestan, Akhere Shahname and Az Avesta. Accordingly, the researchers have investigated the various manners of repetition in creating parallelism in the poems at three levels: phonological parallelism, lexical par...
متن کامل